Hamiltonian Paths in Cartesian Powers of Directed Cycles
نویسندگان
چکیده
The vertex set of the k cartesian power of a directed cycle of length m can be naturally identified with the abelian group (Zm) . For any two elements v = (v1, . . . , vk) and w = (w1, . . . , wk) of (Zm) , it is easy to see that if there is a hamiltonian path from v to w, then v1 + · · ·+ vk ≡ w1 + · · ·+ wk + 1 (mod m). We prove the converse, unless k = 2 and m is odd.
منابع مشابه
Hamiltonian Paths in Cartesian Powers of Directed Cycles
The vertex set of the kth cartesian power of a directed cycle of length rn can be naturally identified with the abelian group For any two elements u = (u l , . . . , uk) and v = (01,. . . , uk) of (z~), it is easy to see that if there is a hamiltonian path from u to u, then u\ + ~ ~ ~ + u i c = v 1 + Â ¥ . . + u k + (modrn). We prove the converse, unless k = 2 and rn is odd.
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملWhen the Cartesian Product of Directed Cycles is
The Cartesian product of two hamiltonian graphs is always hamiltonian. For directed graphs, the analogous statement is false. We show that the Cartesian product C,,, x C,, of directed cycles is hamiltonian if and only if the greatest common divisor (g.c.d.) d of n, and n, is a t least two and there exist positive integers d,, d, so that d, + d, = d and g.c.d. (n,, d,) = g.c.d. (n,, d,) = 1. We ...
متن کاملOn the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Let G be a graph. A 2-rainbow dominating function (or 2-RDF) of G is a function f from V(G) to the set of all subsets of the set {1,2} such that for a vertex v ∈ V (G) with f(v) = ∅, thecondition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled, wher NG(v) is the open neighborhoodof v. The weight of 2-RDF f of G is the value$omega (f):=sum _{vin V(G)}|f(v)|$. The 2-rainbowd...
متن کاملComputing rupture degrees of some graphs
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructed when they do get disrupted. These desirable properties of networks can be measured by various parameters such as connectivity, toughness, tenacity and rupture degree. Among these parameters, rupture degree is comparatively better parameter ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 19 شماره
صفحات -
تاریخ انتشار 2003